Some problems in number theory that arise from group theory
نویسندگان
چکیده
منابع مشابه
Some Problems in Number Theory
A k = max(p,+ t p,), k < p, < p, + , < 2k . In fact I cannot even disprove f(k) = Ak for all sufficiently large k, though it seems likely that f(k) > Ak for all large k. A well known theorem of Pólya and Störmer states that if u > uo(k) then u(u + 1) always contains a prime factor greater than k, thusf(k) can be determined in a finite number of steps, and an explicit bound has been given by Leh...
متن کاملSome Group Theory Problems
This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems in one area. It contains an introduction where I give some necessary definitions and motivations, problems and some discussions of them. For each problem, I try to mention the author. If the author is not given, the prob...
متن کاملSome Problems and Results in Number Theory
During my very long life I published many papers of similar title . Here I want to discuss some of my favorite problems many of which go back 50 years and which I hope are still alive and will outlive me . Recently Graham and I published a book entitled "Old and new problems and results in combinatorial number theory" Monographic N ° 28 de L'Enseignement Mathématique, Univ . de Genéve . This bo...
متن کاملSome Problems in Combinatorial Number Theory
We state and discuss various problems in the general area of arithmetic combinatorics and recent developments related to the ‘sum-product phenomenon’ in the ring of integers, the real and complex numbers and finite fields. In particular, we discuss applications and connections to the theory of exponential sums, Burgess’ estimate, the subspace theorem and to Szemeredi-Trotter type results. In re...
متن کاملSome Problems in Additive Number Theory
(3) f(x) = (log x/log 2) + 0(1)? 1\Mloser and I asked : Is it true that f(2 11) >_ k+2 for sufficiently large k? Conway and Guy showed that the answer is affirmative (unpublished) . P. Erdös, Problems and results in additive number theory, Colloque, Théorie des Nombres, Bruxelles 1955, p . 137 . 2. Let 1 < a 1< . . . < ak <_ x be a sequence of integers so that all the sums ai,+ . . .+ais, i 1 <...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicacions Matemàtiques
سال: 2007
ISSN: 0214-1493
DOI: 10.5565/publmat_pjtn05_09